Generalized Probabilistic Bisection for Stochastic Root-Finding

نویسندگان

  • Sergio Rodriguez
  • Michael Ludkovski
چکیده

We consider numerical schemes for root finding of noisy responses through generalizing the Probabilistic Bisection Algorithm (PBA) to the more practical context where the sampling distribution is unknown and location-dependent. As in standard PBA, we rely on a knowledge state for the approximate posterior of the root location. To implement the corresponding Bayesian updating, we also carry out inference of oracle accuracy, namely learning the probability of correct response. To this end we utilize batched querying in combination with a variety of frequentist and Bayesian estimators based on majority vote, as well as the underlying functional responses, if available. For guiding sampling selection we investigate both Information Directed sampling, as well as Quantile sampling. Our numerical experiments show that these strategies perform quite differently; in particular we demonstrate the efficiency of randomized quantile sampling which is reminiscent of Thompson sampling. Our work is motivated by the root-finding sub-routine in pricing of Bermudan financial derivatives, illustrated in the last section of the paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real-Time Bidding with Side Information

We consider the problem of repeated bidding in online advertising auctions when some side information (e.g. browser cookies) is available ahead of submitting a bid in the form of a d-dimensional vector. The goal for the advertiser is to maximize the total utility (e.g. the total number of clicks) derived from displaying ads given that a limited budget B is allocated for a given time horizon T ....

متن کامل

Deterministic and Stochastic Root Finding in One Dimension for Increasing Convex Functions

We study the one-dimensional root finding problem for increasing convex functions, both in the case where the function can be evaluated exactly and where the function must be simulated so that only confidence interval estimates are available. The algorithms studied are gradient-free and do not depend upon any additional smoothness conditions. We provide a performance guarantee in the determinis...

متن کامل

Load-Frequency Control in a Deregulated Environment Based on Bisection Search

Recently several robust control designs have been proposed to the load-frequency control (LFC) problem. However, the importance and difficulties in the selection of weighting functions of these approaches and the pole-zero cancellation phenomenon associated with it produces closed loop poles. Also the order of robust controllers is as high as the plant. This gives rise to complex structure of s...

متن کامل

Coupled bisection for root ordering

We consider the problem of solving multiple ‘‘coupled’’ root-finding problems at once, in that we can evaluate every function at the same point simultaneously. Using a dynamic programming formulation, we show that a sequential bisection algorithm is a close-to-optimalmethod for finding a rankingwith respect to the zeros of these functions. We show the ranking can be found in linear time, prove ...

متن کامل

Hybrid Probabilistic Search Methods for Simulation Optimization

Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1711.00843  شماره 

صفحات  -

تاریخ انتشار 2017